Quasi-star-free Languages on Infinite Words
نویسنده
چکیده
Quasi-star-free languages were first introduced and studied by Barrington, Compton, Straubing and Thérien within the context of circuit complexity in 1992, and their connections with propositional linear temporal logic were established by Ésik and Ito recently. While these results are all for finite words, in this paper we consider the languages on infinite words.
منابع مشابه
Green's Relations and Their Use in Automata Theory
The objective of this survey is to present the ideal theory of monoids, the so-called Green’s relations, and to illustrate the usefulness of this tool for solving automata related questions. We use Green’s relations for proving four classical results related to automata theory: The result of Schützenberger characterizing star-free languages, the theorem of factorization forests of Simon, the ch...
متن کاملThe solution of two star height problems for regular trees
Regular trees can he detined by two types of rational exprwions. For these two types w;isolve the star-height problem, i.e., we show how to construct a rational expression of minimal star-height from the minimal graph of the given tree (i.e., the analogue of the minimal deterministic automaton for regular languages). In one case, the minimal starheight is the rank (in the Sense of Eggan) of the...
متن کاملA Short Note on Infinite Union/Intersection of Omega Regular Languages
Themost impressivenon-star-freeproperty, firstpointedoutbyWolper [Wol83], “p holds at every even moment” (we in what follows refer to it as P(2)) cannot be expressed by any LTL [Pnu77] formula. As a consequence, numerous extensions or LTL have been presented, such as ETL [VW94], QLTL [SVW87], RLTL [LS07], linear-time μTL [BB87] etc, and all of them are known to be as expressive as (nondetermini...
متن کاملOn Infinite Words Determined by Indexed Languages
We characterize the infinite words determined by indexed languages. An infinite language L determines an infinite word α if every string in L is a prefix of α. If L is regular or context-free, it is known that α must be ultimately periodic. We show that if L is an indexed language, then α is a morphic word, i.e., α can be generated by iterating a morphism under a coding. Since the other directi...
متن کاملHigher-order Operator Precedence Languages
Floyd’s Operator Precedence (OP) languages are a deterministic context-free family having many desirable properties. They are locally and parallely parsable, and languages having a compatible structure are closed under Boolean operations, concatenation and star; they properly include the family of Visibly Pushdown (or Input Driven) languages. OP languages are based on three relations between an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Acta Cybern.
دوره 17 شماره
صفحات -
تاریخ انتشار 2005